Application of the random key based electromagnetism-like heuristic for solving travelling salesman problems

Random-key cuckoo search for the travelling salesman problem

Combinatorial optimization problems are typically NP-hard, and thus very challenging to solve. In this paper, we present the random key cuckoo search (RKCS) algorithm for solving the famous Travelling Salesman Problem (TSP). We used a simplified random-key encoding scheme to pass from a continuous space (real numbers) to a combinatorial space. We also consider the displacement of a solution in ...

On Random Symmetric Travelling Salesman Problems

Let the edges of the complete graph Kn be assigned independent uniform [0; 1] random edge weights. Let ZTSP and Z2FAC be the weights of the minimum length travelling salesman tour and minimum weight 2-factor respectively. We show that whp jZTSP Z2FAC j = o(1). The proof is via by the analysis of a polynomial time algorithm that nds a tour only a little longer than Z2FAC .

On random symmetri travelling salesman problems

Solving Capacity Problems as Asymmetric Travelling Salesman Problems

The railway capacity optimization problem deals with the maximization of the number of trains running on a given network per unit time. In this study, we frame this problem as a typical asymmetrical Travelling Salesman Problem (ATSP), with the ATSP nodes representing the train arrival /departure events and the ATSP total cost representing the total time-interval of the schedule. The application...

Clustering Evolutionary Computation for Solving Travelling Salesman Problems

This paper proposes the methods for solving the traveling salesman problems using clustering techniques and evolutionary methods. Gaussian mixer model and K-means clustering are two clustering techniques that are considered in this paper. The traveling salesman problems are clustered in order to group the nearest nodes in the problems. Then, the evolutionary methods are applied to each cluster....